Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions
نویسندگان
چکیده
We present a new transformation of chosen-plaintext secure predicate encryption schemes with public index into chosen-ciphertext secure schemes. Our construction requires only a universal one-way hash function and is selectively secure in the standard model. The transformation is not generic but can be applied to various existing schemes constructed from bilinear groups. Using common structural properties of these schemes we provide an efficient and simple transformation without overhead in form of one-time signatures or message authentication codes as required in the known generic transformations.
منابع مشابه
CCA-Security for predicate encryption schemes
In this thesis we first take a critical look at established security definitions for predicate encryption with public index (PE) under chosen-plaintext attacks (CPA) and under chosenciphertext attacks (CCA) from the current state of research. In contrast to conventional publickey encryption (PKE), security definitions for PE have to deal with user collusion, which is modeled by an additional ke...
متن کاملConstruction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes
This paper presents a new framework for constructing fully CCA-secure predicate encryption schemes from pair encoding schemes. Our construction is the first in the context of predicate encryption which uses the technique of well-formedness proofs known from public key encryption. The resulting constructions are simpler and more efficient compared to the schemes achieved using known generic tran...
متن کاملDirect Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles
We present a new technique to realize attribute-based encryption (ABE) schemes secure in the standard model against chosen-ciphertext attacks (CCA-secure). Our approach is to extend certain concrete chosen-plaintext secure (CPA-secure) ABE schemes to achieve more efficient constructions than the known generic constructions of CCA-secure ABE schemes. We restrict ourselves to the construction of ...
متن کاملOn the Power of Pair Encodings: Frameworks for Predicate Cryptographic Primitives
Recently Attrapadung (Eurocrypt 2014) proposed a generic framework for fully (adaptively) secure predicate encryption (PE) based on a new primitive, called pair encodings. The author shows that if the underlying pair encoding scheme is either perfectly secure or computationally (doubly-selectively) secure, then the PE scheme will be fully secure. Although the pair encodings were solely introduc...
متن کاملA Twist on the Naor-Yung Paradigm and Its Application to E cient CCA-Secure Encryption from Hard Search Problems
The Naor-Yung (NY) paradigm shows how to build a chosen-ciphertext secure encryption scheme from three conceptual ingredients: a weakly (i.e., IND-CPA) secure encryption scheme, a replication strategy that speci es how to use the weakly secure encryption scheme; concretely, a NY-encryption contains several weak encryptions of the same plaintext, a non-interactive zero-knowledge (NIZK) proof sys...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2014 شماره
صفحات -
تاریخ انتشار 2014